PittsburghV1, France, Analysis, bibRecord, 000307

Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining

Identifieur interne : 000307 ( France/Analysis ); précédent : 000306; suivant : 000308

Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining

Auteurs : F. Cazals [France] ; T. Dreyfus [France] ; S. Sachdeva [États-Unis] ; N. Shah [États-Unis]

Source :

Computer Graphics Forum [ 0167-7055 ] ; 2014-09.

RBID : ISTEX:0694C97F05CFBE104A69B2C35577F02C6F6EC986

Abstract

Choosing balls that best approximate a 3D object is a non‐trivial problem. To answer it, we first address the inner approximation problem, which consists of approximating an object FO defined by a union of n balls with k
Url:

https://api.istex.fr/document/0694C97F05CFBE104A69B2C35577F02C6F6EC986/fulltext/pdf

DOI: 10.1111/cgf.12270

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 000153
to stream Istex, to step Curation: 000153
to stream Istex, to step Checkpoint: 000464
to stream Main, to step Merge: 004B87
to stream Main, to step Curation: 004955
to stream Main, to step Exploration: 004955
to stream France, to step Extraction: 000307

Links to Exploration step

ISTEX:0694C97F05CFBE104A69B2C35577F02C6F6EC986

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining</title>
<author><name sortKey="Cazals, F" sort="Cazals, F" uniqKey="Cazals F" first="F." last="Cazals">F. Cazals</name>
</author>
<author><name sortKey="Dreyfus, T" sort="Dreyfus, T" uniqKey="Dreyfus T" first="T." last="Dreyfus">T. Dreyfus</name>
</author>
<author><name sortKey="Sachdeva, S" sort="Sachdeva, S" uniqKey="Sachdeva S" first="S." last="Sachdeva">S. Sachdeva</name>
</author>
<author><name sortKey="Shah, N" sort="Shah, N" uniqKey="Shah N" first="N." last="Shah">N. Shah</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:0694C97F05CFBE104A69B2C35577F02C6F6EC986</idno>
<date when="2014" year="2014">2014</date>
<idno type="doi">10.1111/cgf.12270</idno>
<idno type="url">https://api.istex.fr/document/0694C97F05CFBE104A69B2C35577F02C6F6EC986/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000153</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000153</idno>
<idno type="wicri:Area/Istex/Curation">000153</idno>
<idno type="wicri:Area/Istex/Checkpoint">000464</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000464</idno>
<idno type="wicri:doubleKey">0167-7055:2014:Cazals F:greedy:geometric:algorithms</idno>
<idno type="wicri:Area/Main/Merge">004B87</idno>
<idno type="wicri:Area/Main/Curation">004955</idno>
<idno type="wicri:Area/Main/Exploration">004955</idno>
<idno type="wicri:Area/France/Extraction">000307</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main">Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining</title>
<author><name sortKey="Cazals, F" sort="Cazals, F" uniqKey="Cazals F" first="F." last="Cazals">F. Cazals</name>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>Inria Sophia‐Antipolis, Sophia‐Antipolis</wicri:regionArea>
<wicri:noRegion>Sophia‐Antipolis</wicri:noRegion>
<wicri:noRegion>Sophia‐Antipolis</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Dreyfus, T" sort="Dreyfus, T" uniqKey="Dreyfus T" first="T." last="Dreyfus">T. Dreyfus</name>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>Inria Sophia‐Antipolis, Sophia‐Antipolis</wicri:regionArea>
<wicri:noRegion>Sophia‐Antipolis</wicri:noRegion>
<wicri:noRegion>Sophia‐Antipolis</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Sachdeva, S" sort="Sachdeva, S" uniqKey="Sachdeva S" first="S." last="Sachdeva">S. Sachdeva</name>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
<affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Princeton University, Princeton</wicri:regionArea>
<orgName type="university">Université de Princeton</orgName>
<placeName><settlement type="city">Princeton (New Jersey)</settlement>
<region type="state">New Jersey</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Shah, N" sort="Shah, N" uniqKey="Shah N" first="N." last="Shah">N. Shah</name>
<affiliation></affiliation>
<affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Carnegie Mellon University, Pittsburgh</wicri:regionArea>
<placeName><settlement type="city">Pittsburgh</settlement>
<region type="state">Pennsylvanie</region>
<settlement type="city">Pittsburgh</settlement>
</placeName>
<orgName type="university">Université Carnegie-Mellon</orgName>
</affiliation>
<affiliation></affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j" type="main">Computer Graphics Forum</title>
<title level="j" type="alt">COMPUTER GRAPHICS FORUM</title>
<idno type="ISSN">0167-7055</idno>
<idno type="eISSN">1467-8659</idno>
<imprint><biblScope unit="vol">33</biblScope>
<biblScope unit="issue">6</biblScope>
<biblScope unit="page" from="1">1</biblScope>
<biblScope unit="page" to="17">17</biblScope>
<biblScope unit="page-count">17</biblScope>
<date type="published" when="2014-09">2014-09</date>
</imprint>
<idno type="ISSN">0167-7055</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0167-7055</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract">Choosing balls that best approximate a 3D object is a non‐trivial problem. To answer it, we first address the inner approximation problem, which consists of approximating an object FO defined by a union of n balls with k</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>États-Unis</li>
</country>
<region><li>New Jersey</li>
<li>Pennsylvanie</li>
</region>
<settlement><li>Pittsburgh</li>
<li>Princeton (New Jersey)</li>
</settlement>
<orgName><li>Université Carnegie-Mellon</li>
<li>Université de Princeton</li>
</orgName>
</list>
<tree><country name="France"><noRegion><name sortKey="Cazals, F" sort="Cazals, F" uniqKey="Cazals F" first="F." last="Cazals">F. Cazals</name>
</noRegion>
<name sortKey="Cazals, F" sort="Cazals, F" uniqKey="Cazals F" first="F." last="Cazals">F. Cazals</name>
<name sortKey="Cazals, F" sort="Cazals, F" uniqKey="Cazals F" first="F." last="Cazals">F. Cazals</name>
<name sortKey="Dreyfus, T" sort="Dreyfus, T" uniqKey="Dreyfus T" first="T." last="Dreyfus">T. Dreyfus</name>
<name sortKey="Dreyfus, T" sort="Dreyfus, T" uniqKey="Dreyfus T" first="T." last="Dreyfus">T. Dreyfus</name>
<name sortKey="Dreyfus, T" sort="Dreyfus, T" uniqKey="Dreyfus T" first="T." last="Dreyfus">T. Dreyfus</name>
</country>
<country name="États-Unis"><noRegion><name sortKey="Sachdeva, S" sort="Sachdeva, S" uniqKey="Sachdeva S" first="S." last="Sachdeva">S. Sachdeva</name>
</noRegion>
<name sortKey="Sachdeva, S" sort="Sachdeva, S" uniqKey="Sachdeva S" first="S." last="Sachdeva">S. Sachdeva</name>
<name sortKey="Sachdeva, S" sort="Sachdeva, S" uniqKey="Sachdeva S" first="S." last="Sachdeva">S. Sachdeva</name>
<name sortKey="Shah, N" sort="Shah, N" uniqKey="Shah N" first="N." last="Shah">N. Shah</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Amérique/explor/PittsburghV1/Data/France/Analysis

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000307 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000307 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Amérique
   |area=    PittsburghV1
   |flux=    France
   |étape=   Analysis
   |type=    RBID
   |clé=     ISTEX:0694C97F05CFBE104A69B2C35577F02C6F6EC986
   |texte=   Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining
}}

This area was generated with Dilib version V0.6.38.
Data generation: Fri Jun 18 17:37:45 2021. Site generation: Fri Jun 18 18:15:47 2021

	Serveur d'exploration sur Pittsburgh
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur Pittsburgh

Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining

Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining

Source :

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri